Marcin Pilipczuk: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

1

On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs

Pilipczuk, Michał, Wrochna, Marcin

Journal:

ACM Transactions on Computation Theory

Year:

2018

Language:

english

File:

PDF, 756 KB

english, 2018

2

Directed Multicut is W[1]-hard, Even for Four Terminal Pairs

Pilipczuk, Marcin, Wahlström, Magnus

Journal:

ACM Transactions on Computation Theory

Year:

2018

Language:

english

File:

PDF, 507 KB

english, 2018

3

[ACM Press the Forty-Seventh Annual ACM - Portland, Oregon, USA (2015.06.14-2015.06.17)] Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC '15 - The Power of Dynamic Distance Oracles

Łącki, Jakub, Oćwieja, Jakub, Pilipczuk, Marcin, Sankowski, Piotr, Zych, Anna

Year:

2015

Language:

english

File:

PDF, 855 KB

english, 2015

4

An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs

Karpov, Nikolai, Pilipczuk, Marcin, Zych-Pawlewicz, Anna

Journal:

Year:

2018

Language:

english

File:

PDF, 655 KB

english, 2018

5

Tight Lower Bounds for the Complexity of Multicoloring

Bonamy, Marthe, Kowalik, łUkasz, Pilipczuk, Michał, Socała, Arkadiusz, Wrochna, Marcin

Journal:

ACM Transactions on Computation Theory

Year:

2019

File:

PDF, 454 KB

2019

6

Tight Lower Bounds for the Complexity of Multicoloring

Bonamy, Marthe, Kowalik, łUkasz, Pilipczuk, Michał, Socała, Arkadiusz, Wrochna, Marcin

Journal:

ACM Transactions on Computation Theory

Year:

2019

Language:

english

File:

PDF, 454 KB

english, 2019

7

Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs

Kratsch, Stefan, Pilipczuk, Marcin, Rai, Ashutosh, Raman, Venkatesh

Journal:

ACM Transactions on Computation Theory

Year:

2015

Language:

english

File:

PDF, 173 KB

english, 2015

8

Kernelization hardness of connectivity problems in -degenerate graphs

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Discrete Applied Mathematics

Year:

2012

Language:

english

File:

PDF, 296 KB

english, 2012

9

Faster deterministic Feedback Vertex Set

Kociumaka, Tomasz, Pilipczuk, Marcin

Journal:

Information Processing Letters

Year:

2014

Language:

english

File:

PDF, 223 KB

english, 2014

10

Parameterized Algorithms || Introduction

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 506 KB

english, 2015

11

[IEEE 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) - Baltimore, MD, USA (2019.11.9-2019.11.12)] 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) - A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs

Cohen-Addad, Vincent, Pilipczuk, Michal, Pilipczuk, Marcin

Year:

2019

File:

PDF, 685 KB

2019

12

A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More)

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

SIAM Journal on Computing

Year:

2012

Language:

english

File:

PDF, 261 KB

english, 2012

13

Parameterized Algorithms || Kernelization

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 612 KB

english, 2015

14

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs

Bacsó, Gábor, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Tuza, Zsolt, van Leeuwen, Erik Jan

Journal:

Year:

2019

Language:

english

File:

PDF, 599 KB

english, 2019

15

Parameterized Algorithms || Matroids

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 718 KB

english, 2015

16

[Society for Industrial and Applied Mathematics Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms - ()] Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms - Independence and Efficient Domination on P 6 -free Graphs

Lokshtanov, Daniel, Pilipczuk, Marcin, Leeuwen, Erik Jan van

Language:

english

File:

PDF, 265 KB

english

17

Even Faster Exact Bandwidth

Cygan, Marek, Pilipczuk, Marcin

Journal:

ACM Transactions on Algorithms

Year:

2012

Language:

english

File:

PDF, 167 KB

english, 2012

18

Subexponential Parameterized Algorithm for I nterval C ompletion

Bliznets, Ivan, Fomin, Fedor V., Pilipczuk, Marcin, Pilipczuk, MichaŁ

Journal:

ACM Transactions on Algorithms

Year:

2018

Language:

english

File:

PDF, 4.49 MB

english, 2018

19

On the Hardness of Losing Width

Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk…

Journal:

Theory of Computing Systems

Year:

2014

Language:

english

File:

PDF, 444 KB

english, 2014

20

Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms

Cygan, Marek, Pilipczuk, Marcin

Journal:

Information Processing Letters

Year:

2013

Language:

english

File:

PDF, 151 KB

english, 2013

21

A Subexponential Parameterized Algorithm for Proper Interval Completion

Bliznets, Ivan, Fomin, Fedor V., Pilipczuk, Marcin, Pilipczuk, Michał

Journal:

SIAM Journal on Discrete Mathematics

Year:

2015

Language:

english

File:

PDF, 366 KB

english, 2015

22

Known Algorithms for Edge Clique Cover are Probably Optimal

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał

Journal:

SIAM Journal on Computing

Year:

2016

Language:

english

File:

PDF, 321 KB

english, 2016

23

Deleting Vertices to Graphs of Bounded Genus

Kociumaka, Tomasz, Pilipczuk, Marcin

Journal:

Year:

2019

Language:

english

File:

PDF, 784 KB

english, 2019

24

Sitting Closer to Friends than Enemies, Revisited

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

Theory of Computing Systems

Year:

2015

Language:

english

File:

PDF, 420 KB

english, 2015

25

[IEEE 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2016.10.9-2016.10.11)] 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) - Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering

Fomin, Fedor V., Lokshtanov, Daniel, Marx, Daniel, Pilipczuk, Marcin, Pilipczuk, Michal, Saurabh, Saket

Year:

2016

Language:

english

File:

PDF, 267 KB

english, 2016

26

Dominating set is fixed parameter tractable in claw-free graphs

Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Theoretical Computer Science

Year:

2011

Language:

english

File:

PDF, 450 KB

english, 2011

27

Scheduling Partially Ordered Jobs Faster than 2n

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Year:

2014

Language:

english

File:

PDF, 803 KB

english, 2014

28

The negative association property for the absolute values of random variables equidistributed on a generalized Orlicz ball

Marcin Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Year:

2008

Language:

english

File:

PDF, 614 KB

english, 2008

29

Subset Feedback Vertex Set Is Fixed-Parameter Tractable

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

SIAM Journal on Discrete Mathematics

Year:

2013

Language:

english

File:

PDF, 265 KB

english, 2013

30

Minimum Bisection Is Fixed-Parameter Tractable

Cygan, Marek, Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Journal:

SIAM Journal on Computing

Year:

2019

File:

PDF, 2.11 MB

2019

31

Multi-budgeted Directed Cuts

Kratsch, Stefan, Li, Shaohua, Marx, Dániel, Pilipczuk, Marcin, Wahlström, Magnus

Journal:

Year:

2019

Language:

english

File:

PDF, 537 KB

english, 2019

32

Finding Hamiltonian Cycle in Graphs of Bounded Treewidth

Ziobro, Michał, Pilipczuk, Marcin

Journal:

Journal of Experimental Algorithmics

Year:

2019

Language:

english

File:

PDF, 1.74 MB

english, 2019

33

Parameterized Algorithms ||

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 7.88 MB

english, 2015

34

On multiway cut parameterized above lower bounds

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

ACM Transactions on Computation Theory

Year:

2013

Language:

english

File:

PDF, 117 KB

english, 2013

35

[IEEE 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2014.10.18-2014.10.21)] 2014 IEEE 55th Annual Symposium on Foundations of Computer Science - Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth

Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michal, Saurabh, Saket

Year:

2014

Language:

english

File:

PDF, 358 KB

english, 2014

36

Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth

Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Journal:

SIAM Journal on Computing

Year:

2017

Language:

english

File:

PDF, 365 KB

english, 2017

37

Polynomial Kernelization for Removing Induced Claws and Diamonds

Marek Cygan,Marcin Pilipczuk,Michał Pilipczuk…

Journal:

Theory of Computing Systems

Year:

2017

Language:

english

File:

PDF, 619 KB

english, 2017

38

Cutwidth: Obstructions and Algorithmic Aspects

Giannopoulou, Archontia C., Pilipczuk, Michał, Raymond, Jean-Florent, Thilikos, Dimitrios M., Wrochna, Marcin

Journal:

Year:

2018

Language:

english

File:

PDF, 673 KB

english, 2018

39

[Society for Industrial and Applied Mathematics Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms - ()] Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms - Fully polynomial-time parameterized computations for graphs and matrices of low treewidth

Fomin, Fedor V., Lokshtanov, Daniel, Pilipczuk, Michał, Saurabh, Saket, Wrochna, Marcin

Language:

english

File:

PDF, 473 KB

english

40

Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs

Kratsch, Stefan, Pilipczuk, Marcin, Pilipczuk, MichaŁ, Wahlström, Magnus

Journal:

SIAM Journal on Discrete Mathematics

Year:

2015

Language:

english

File:

PDF, 485 KB

english, 2015

41

Finding Hamiltonian Cycle in Graphs of Bounded Treewidth

Ziobro, Michał, Pilipczuk, Marcin

Journal:

Journal of Experimental Algorithmics

Year:

2019

File:

PDF, 1.74 MB

2019

42

Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2n

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Year:

2014

Language:

english

File:

PDF, 517 KB

english, 2014

43

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable

Cygan, Marek, Marx, Daniel, Pilipczuk, Marcin, Pilipczuk, Michal

Year:

2013

Language:

english

File:

PDF, 586 KB

english, 2013

44

Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor

Jansen, Bart M. P., Pilipczuk, Marcin, Wrochna, Marcin

Journal:

Year:

2019

Language:

english

File:

PDF, 694 KB

english, 2019

45

Some results on Vizing’s conjecture and related problems

Marcin Pilipczuk, Michał Pilipczuk, Riste Škrekovski

Journal:

Discrete Applied Mathematics

Year:

2012

Language:

english

File:

PDF, 238 KB

english, 2012

46

[IEEE 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2012.10.20-2012.10.23)] 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science - Designing FPT Algorithms for Cut Problems Using Randomized Contractions

Chitnis, Rajesh, Cygan, Marek, Hajiaghayi, MohammadTaghi, Pilipczuk, Marcin, Pilipczuk, Michal

Year:

2012

Language:

english

File:

PDF, 258 KB

english, 2012

47

Independence and Efficient Domination on P 6 -free Graphs

Lokshtanov, Daniel, Pilipczuk, Marcin, Leeuwen, Erik Jan Van

Journal:

ACM Transactions on Algorithms

Year:

2017

Language:

english

File:

PDF, 1.12 MB

english, 2017

48

Minimum Bisection Is Fixed-Parameter Tractable

Cygan, Marek, Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Journal:

SIAM Journal on Computing

Year:

2019

Language:

english

File:

PDF, 2.11 MB

english, 2019

49

Polynomial Treedepth Bounds in Linear Colorings

Kun, Jeremy, OâBrien, Michael P., Pilipczuk, Marcin, Sullivan, Blair D.

Journal:

Year:

2020

File:

PDF, 1.90 MB

2020

50

Capacitated domination faster than

Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Information Processing Letters

Year:

2011

Language:

english

File:

PDF, 155 KB

english, 2011

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@1delivery.pm

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски